System and method of timing characterization for semiconductor circuit

ABSTRACT

A method includes: receiving a library associated with a cell; determining a plurality of candidate hold times for the cell; acquiring a plurality of candidate setup times corresponding to the plurality of candidate hold times, wherein a data delay associated with each of the candidate setup time fulfills a data delay constraint for the cell; adding the plurality of candidate setup times to the plurality of candidate hold times, respectively, to obtain a plurality of candidate time windows; and selecting a target time window having a minimal time span among the candidate time windows. At least one of the receiving, determining, acquiring, adding and selecting steps is conducted by at least one processor.

PRIORITY CLAIM AND CROSS-REFERENCE

This application claims priority to U.S. Patent Provisional ApplicationNo. 62/737,008 filed Sep. 26, 2018 and U.S. patent application Ser. No.16/578,989 filed Sep. 23, 2019, the disclosures of which are herebyincorporated by reference in its entirety.

BACKGROUND

In advanced semiconductor technologies, the continuing reduction indevice size and increasingly complicated circuit arrangements have madethe designing and fabrication of integrated circuits (ICs) morechallenging and costly. Before the circuit design for the ICs isdelivered for mass production, the design must be confirmed to meet thedesign specification and manufacturing criteria. In order to detectdesign errors or defects as early as possible, computer-aided circuitdesign tools, which assist circuit designers in identifying potentialcircuit errors, have become widely accepted in the semiconductorindustry. However, as circuit complexity and device density continue toincrease quickly, the software procedures that conduct circuit designand verification now consume a great deal of time and resources, andhave difficulties in meeting the demands for circuit design in earlydesign stages. Therefore, it is necessary to improve the design flow forreducing the design cycle time while maintaining the design quality.

BRIEF DESCRIPTION OF THE DRAWINGS

Aspects of the present disclosure are best understood from the followingdetailed description when read with the accompanying figures. It shouldbe noted that, in accordance with the standard practice in the industry,various features are not drawn to scale. In fact, the dimensions of thevarious features may be arbitrarily increased or reduced for clarity ofdiscussion.

FIG. 1 is a schematic diagram illustrating a design flow of anintegrated circuit (IC), in accordance with some embodiments.

FIG. 2A is a schematic circuit diagram in accordance with someembodiments.

FIG. 2B is a schematic diagram showing a setup time and a hold time of asequential cell in the circuit of FIG. 2A, in accordance with someembodiments.

FIG. 3A is a schematic flow diagram of a method of measuring a setuptime based on a predetermined hold time, in accordance with someembodiments.

FIG. 3B is a schematic diagram showing candidate setup times of FIG. 3A,in accordance with some embodiments.

FIG. 3C is a schematic flow diagram of a method of measuring a hold timebased on a predetermined setup time, in accordance with someembodiments.

FIG. 4A is a schematic flow diagram of a method of measuring a timingwindow in accordance with some embodiments.

FIG. 4B is a schematic diagram showing candidate timing windows of FIG.4A, in accordance with some embodiments.

FIG. 5A is a schematic flow diagram of a method of measuring a timingwindow in accordance with some embodiments.

FIG. 5B is a schematic diagram showing candidate timing windows of FIG.5A, in accordance with some embodiments.

FIG. 6A is a schematic flow diagram of a method of measuring a timingwindow in accordance with some embodiments.

FIG. 6B is a schematic diagram showing candidate timing windows of FIG.6A, in accordance with some embodiments.

FIG. 7 is a schematic diagram of a system implementing layout designs,in accordance with some embodiments.

DETAILED DESCRIPTION

The following disclosure provides many different embodiments, orexamples, for implementing different features of the provided subjectmatter. Specific examples of components and arrangements are describedbelow to simplify the present disclosure. These are, of course, merelyexamples and are not intended to be limiting. For example, the formationof a first feature over or on a second feature in the description thatfollows may include embodiments in which the first and second featuresare formed in direct contact, and may also include embodiments in whichadditional features may be formed between the first and second features,such that the first and second features may not be in direct contact. Inaddition, the present disclosure may repeat reference numerals and/orletters in the various examples. This repetition is for the purpose ofsimplicity and clarity and does not in itself dictate a relationshipbetween the various embodiments and/or configurations discussed.

Further, spatially relative terms, such as “beneath,” “below,” “lower,”“above,” “upper” and the like, may be used herein for ease ofdescription to describe one element or feature's relationship to anotherelement(s) or feature(s) as illustrated in the figures. The spatiallyrelative terms are intended to encompass different orientations of thedevice in use or operation in addition to the orientation depicted inthe figures. The apparatus may be otherwise oriented (rotated 90 degreesor at other orientations) and the spatially relative descriptors usedherein may likewise be interpreted accordingly.

Notwithstanding that the numerical ranges and parameters setting forththe broad scope of the disclosure are approximations, the numericalvalues set forth in the specific examples are reported as precisely aspossible. Any numerical value, however, inherently contains certainerrors necessarily resulting from the deviation normally found in therespective testing measurements. Also, as used herein, the terms“about,” “substantial” or “substantially” generally mean within 10%, 5%,1% or 0.5% of a given value or range. Alternatively, the terms “about,”“substantial” or “substantially” mean within an acceptable standarderror of the mean when considered by one of ordinary skill in the art.Other than in the operating/working examples, or unless otherwiseexpressly specified, all of the numerical ranges, amounts, values andpercentages such as those for quantities of materials, durations oftimes, temperatures, operating conditions, ratios of amounts, and thelikes thereof disclosed herein should be understood as modified in allinstances by the terms “about,” “substantial” or “substantially.”Accordingly, unless indicated to the contrary, the numerical parametersset forth in the present disclosure and attached claims areapproximations that can vary as desired. At the very least, eachnumerical parameter should at least be construed in light of the numberof reported significant digits and by applying ordinary roundingtechniques. Ranges can be expressed herein as from one endpoint toanother endpoint or between two endpoints. All ranges disclosed hereinare inclusive of the endpoints, unless specified otherwise.

The present disclosure discusses a timing parameter calculationmethodology for characterizing a logic element in the design stage ofmanufacturing semiconductor ICs. When a synthesis operation is used forimplementing a design idea (e.g., a circuit layout is generated asdesign data), a cell library is usually provided for facilitating thedesign process. The cell library may include a list of standard cellswith associated parameters describing the electrical or geometricalcharacteristics of the cells in a quantitative perspective. Among theparameters for ensuring proper functioning of the sequential logiccells, the setup time and hold time are recognized as two essentialelements. For a typical sequential logic cell, e.g., a register or alatch, that has a data input port and a clock input port, the input datasignal received from the data input port needs to be in a stable statebefore, during and after the clock transition in order for suchsequential logic cell to successfully record the input data. To bespecific, the setup time is generally referred to as the minimum lengthof time before the clock transition time during which the input datasignal must be stable. The hold time is generally referred to as theminimum length of time after the clock transition time during which theinput data signal must remain stable. The setup time and hold timetherefore collectively comprise a time window during which the inputdata signal remains stable. A greater time window provides greatertolerance for data access, but introduces a longer delay. Therefore, anoptimized setup time or hold time is sought to strike a balance betweenthe circuit speed and system integrity. Moreover, the timing parametersshould be determined with care in order to deal with timing paths thatare loaded to a sequential cell having large differences in path delay.

When the cells are identified and incorporated into the design data,their associated timing parameters are provided as side information foruse in simulating the design data. In most cases, if one or more timingpaths are identified as violating the design requirements during atiming analysis phase, e.g., static timing analysis, in which a setuptime violation or a hold time violation is found, it is determined thatthe design data fails to meet the design specification. Such timingviolations usually occur to sequential cells that are loaded with ashort path and a long path in which the long path has a relatively muchlonger delay than the short path. Additional iterations of designrefinement may be required to generate a design data in which all thetiming issues are resolved. However, in some instances a design data maycontain an erroneous logic path that successfully passes the timinganalysis, but that is subsequently detected in a later simulation, or,worse yet, is not detected until the functional test of the fabricatedchip. As a result, the cost and cycle time for the circuit design may beincreased significantly.

In the present disclosure, an improved timing characterization methodand a system for implementing the method are proposed. In order toaddress the increasing likelihood of logic paths with timing violationsthat cannot be successfully identified in a current design environment,it is proposed to revisit the design of standard cell libraries in whichthe timing parameters, e.g., the setup time and the hold time of asequential logic cell, are reshaped. A timing characterization scheme isapplied to further increase the required length of the setup time or thehold time of the sequential logic cell. As such, by moderatelyincreasing the setup time and the hold time, the timing violationsresulting from the large delay difference between the short and longpaths for the sequential logic cell can be corrected. Meanwhile, thecircuit speed is kept at an acceptable level with the increased setuptime and increased hold time. The performance of the static timinganalysis and troubleshooting can be enhanced accordingly.

FIG. 1 is a schematic diagram illustrating a design flow 10 of asemiconductor integrated circuit (IC), in accordance with someembodiments. The design flow 10, employed for designing semiconductorICs or chips, utilizes one or more electronic design automation (EDA)tools to perform operations therein. A workstation or personal computeris typically used in executing the tools to accomplish the design flow10. The design flow 10 includes a system design stage 110, a logicdesign stage 120, a synthesis stage 130, a pre-layout simulation stage140, a placement and routing development stage 150, a parameterextraction stage 160, a post-layout simulation stage 170, a photomaskgeneration stage 190 and a circuit fabrication stage 191.

Initially, at the system design stage 110, a systematic architecture forthe chip of interest is provided with a high-level description. Duringstage 110, the chip functions along with performance requirements aredetermined according to a design specification. The chip functions areusually represented by respective schematic functional modules orblocks. In addition, an optimization or performance trade-off may besought to achieve the design specification at acceptable levels of costand power.

At the logic design stage 120, the functional modules or blocks aredescribed in a register transfer level (RTL) using a hardwaredescription language. Commercially available language tools aregenerally used, such as Verilog or VHDL. In an embodiment, a preliminaryfunctionality check is performed during stage 120 to verify if theimplemented functions conform to the specification set forth in stage110.

Subsequently, at the synthesis stage 130, the modules in the RTLdescriptions are converted into an instance of design data, e.g.,netlist data, where the circuit structure, e.g., logic gates andregisters, of each function module are established. In an embodiment, astandard cell library 132 is provided to supply different classes oflow-level circuits, i.e., standard cells, serving specific Boolean logicor sequential logic functions. In some embodiments, technology mappingof logic gates and registers to available cells in the standard celllibraries are conducted. Further, the design data or netlist data isoffered to describe the functional relationship of the chip at a gatelevel. The standard cell library 132 may be provided by an IC designer,an IC manufacturing company, a computer-aided design (CAD) tool provideror any relevant third party. The standard cell library 132 also providesthe parameters associated with each cell, such as the timing, power,voltage, and the like. In an embodiment, the netlist data is transformedfrom the gate-level view to a transistor-level view. In an embodiment,when the library is provided or updated (as will be described insubsequent paragraphs herein) and incorporated into the CAD tool, the ICdesigner can improve the updated library by identifying violations ofthe design rule (e.g., timing violations) and revising the originalnetlist data in response to the identified violations.

Subsequently, the gate-level netlist data is verified at the pre-layoutsimulation stage 140. During the verification process of stage 140, ifsome functions fail the verification in the simulation, the design flow10 may be paused temporarily or may go back to stage 110 or 120 forfurther modification. After the pre-layout simulation stage 140, thechip design has passed a preliminary verification and the front-enddesign process is completed. Next, a back-end physical design process isconducted.

During the placement and routing stage 150, a physical architecturerepresenting the chip, determined during the front-end process, isimplemented. The layout development involves a placement operation and arouting operation in sequence. Detailed structures and associatedgeometries for the components of the chip are determined in theplacement operation. Interconnects among different components are routedsubsequent to the placement operation. Both placement and routingoperations are performed to meet the requirement of a design rule check(DRC) deck so that the manufacturing constraints of the chip arefulfilled. In an embodiment, a clock tree synthesis operation isperformed at the placement and routing stage for a digital circuit inwhich clock generators and circuits are incorporated into the design. Inan embodiment, a post-routing operation is performed subsequent to thepreliminary routing operation in order to resolve timing issuesdiscovered during the preliminary routing operation. Once the placementand routing stage 150 is completed, a placed-and-routed layout iscreated and a netlist along with data on placement and routing isgenerated accordingly.

During the parameter extraction stage 160, a layout parameter extraction(LPE) operation is conducted to derive layout-dependent parameters, suchas parasitic resistance and capacitance, based on the layout developedin the placement and routing stage 150. Subsequently, a post-layoutnetlist data, which includes the layout-dependent parameters, isgenerated.

During the post-layout simulation stage 170, a physical verification isperformed, taking into consideration the parameters acquired in previousstages. A simulation of transistor-level behavior is conducted toexamine whether the chip performance derived by the post-layout netlistmeets the required system specifications. In some embodiments, thepost-layout simulation is performed to minimize probability ofelectrical issues or layout difficulties during the chip manufacturingprocess. In an embodiment, the standard cell library 132 is provided notonly to the operations in stage 130, but also to the operations instages 140, 150, 160 and 170 so that the electrical or geometricparameters of cells and other features listed in the standard celllibrary 132 can be leveraged to emulate the real-world performance ofthe circuits throughout the design phase.

Next, in stage 180, it is determined whether the post-layout netlistmeets the design specifications. If the result of the post-layoutsimulation is unfavorable, the design flow 10 loops back to previousstages for tuning functionalities or structures. For example, the designflow 10 may loop back to stage 150 where the layout is re-developed toresolve issues from a physical perspective. Alternatively, the designflow 10 may retreat to an earlier stage 110 or 120 to recast the chipdesign from a functional level in case the problems cannot be resolvedwithin the back-end process.

If the post-layout netlist passes the verification, the circuit designis accepted and then signed off accordingly. The chip is manufacturedaccording to the accepted post-layout netlist. In an embodiment, duringstage 190, at least one photomask is generated based on the verifiedpost-layout netlist in stage 170. A photomask is a patterned mask usedto allow a portion of light to pass through while blocking otherportions of the light in order to form a pattern of features on alight-sensitive layer, e.g., a photoresist layer, on a wafer. Thephotomask is used to transfer the patterns of the verified post-layoutnetlist onto wafers. In some embodiments, a multi-layer layout netlistmay require a set of photomasks in which the feature pattern in eachlayer is established in the corresponding photomask. As a result, thepatterns of the layout netlist formed on the photomasks are transferredto the light-sensitive layer through an exposure operation.

During stage 191, the circuit is fabricated on the wafer using thephotomasks generated in stage 190. The fabrication may involve knownsemiconductor manufacturing operations, such as lithography, etching,deposition, and thermal operations. In some embodiments, a testingoperation may be utilized in an intermediate or final phase of stage 191to ensure physical and functional integrity of the fabricated circuit.In some embodiments, a singulation operation may be used to separate thecircuit wafer into individual circuit dies. The fabrication of thecircuit is thus completed.

The design flow 10 illustrated in FIG. 1 is exemplary. Modifications tothe above-mentioned stages, such as change of order for the stages,partition of the stages, and deletion or addition of stages, are withinthe contemplated scope of the present disclosure.

FIG. 2A is a schematic circuit diagram 20 in accordance with someembodiments. The circuit 20 is representative of a design data (e.g.,the netlist data in FIG. 1) and includes several sequential logic cells,such as flip-flops FF1, FF2, FF3 and FFX. A combinational logic cell,i.e., a NAND gate N1, receives input data from the flip-flops FF1, FF2and FF3 through a first path INTA and a second path INTB, respectively,and provides output data to the flip-flop FFX through a third path INTC.The first path INTA is formed between the flip-flop FF1 and the NANDgate N1 free of other circuits. The second path INTB is formed betweenthe two flip-flops FF2 and FF3 and the NAND gate N1 with additionalintervening sequential cells. It is presumed that the first path INTAgenerates a short delay, while the second path INTB generates arelatively long delay compared to the first path INTA due to theintervening cells. The flip-flop FFX has an input port D, an output portQ, and a clock input CK. The output data signal of the gate N1 is loadedto the input port D through the third path INTC and a reference clocksignal CLK is fed to the clock input CK. The flip-flop FFX reads theinput data signal in synchronization with the reference clock signal CLKat the rising edge or falling edge of the reference clock signal CLK andprovides the output data with a data delay of the cell. Such data delay,generally referred to as a clock-to-Q time (Clk_to_q), is defined as atime difference between the rising edge of the reference clock signalCLK and the time at which the output data signal attains its desiredlevel.

FIG. 2B is a schematic diagram showing a setup time and a hold time of asequential cell, such as the flip-flop FFX, in the circuit 20 of FIG.2A, in accordance with some embodiments. Assume that the input datasignal at the input port D of the flip-flop FFX is to be read at a timeTe of the rising-edge of the reference clock signal CLK. The left plotof FIG. 2B shows an input data signal at a high level, and the rightplot of FIG. 2B shows another input data signal at a low level. Asdiscussed previously, the setup time (t_setup) of the flip-flop FFX isdefined as a time span during which the input data signal should beready before the rising-edge time Te. The hold time (t_hold) of theflip-flop FFX is defined as a time span during which the input datasignal should remain stable after the rising-edge time Te. A time windowthat defines the valid period of the input data is thus comprised of thesetup time and the hold time. The setup time and the hold time requiredfor a sequential cell, such as the flip-flop FFX, is determined by thedesign of the cell, and thus the electrical characteristics, such ascircuit design, circuit topology, and manufacturing process, of the cellmay affect the eventual setup time and hold time of the cell. Therefore,the setup time and the hold time of each cell should be determinedproperly and included in the library for facilitating the designprocess.

FIG. 3A is a schematic flow diagram of a method 30 of measuring a setuptime based on a predetermined hold time, in accordance with someembodiments. FIG. 3B is a schematic diagram showing candidate setuptimes of FIG. 3A, in accordance with some embodiments. Initially, instep 302, a library associated with a cell is received. The cell is asequential cell and may be a flop, a latch or a register. Apredetermined hold time is also received. In an embodiment, thepredetermined hold time is an ideal hold time TH_i of the cell. For anordinary cell, the determination procedures of its setup time and itshold time are correlated. Moreover, when the setup time of a cell is setlarge enough, the hold time of the cell may be substantially at itsminimum and will not be reduced further. The same result applies to thehold time of the cell. In view of the above, throughout the presentdisclosure, the ideal hold time TH_i of the cell is defined as anarbitrarily large time span for which the acquired setup time of thecell is substantially at its minimum in response to the ideal hold time.In an embodiment, the ideal hold time TH_i is set as a cycle time of areference clock for the cell.

In step 304, a plurality of candidate setup times (represented by [TS_1,TS_2, . . . , TS_N], in which N is a positive integer) of the cell,which are less than or no greater than a maximal setup time TS_M, aredetermined. The respective plots of candidate setup times are shown inFIG. 3B. In an embodiment, the maximal setup time TS_M is set as a cycletime of the reference clock for the cell. In an alternative embodiment,the maximal setup time TS_M is set as one half, one third, one tenth orother smaller ratios of the clock cycle time. The candidate setup timesmay be set as greater than a predetermined minimal setup time TS_S. Inan embodiment, the candidate setup times are arranged in an arithmeticsequence, e.g., [a, a+d, a+2d, . . . a+(N−1)d]. In an embodiment, eachpair of consecutive candidate setup times of the plurality of candidatesetup times has a same time length difference. In an embodiment, thecandidate setup times are provided using another form of sequence, e.g.,the setup times form a series of [a, ar, ar², ar³, . . . , ar^(N-1)] inwhich the initial term a and the ratio r are real numbers.

In step 306, a simulation is conducted to acquire a plurality of datadelays of the cell corresponding to the plurality of candidate setuptimes. The simulation is conducted in response to the ideal hold timeTH_i according to the library and the reference clock. In order toacquire information about characteristics of the cell, at least one testinput data signal is fed to the cell through the input port during atime span in accordance with one of the plurality of candidate setuptimes and the ideal hold time. An output data signal is detected at theoutput port of the cell with a data delay corresponding to the selectedcandidate setup time. In an embodiment, the ideal hold time TH_i is setas a value smaller than the cycle time of the reference clock signal butmuch greater than a typical clock-to-Q time, e.g., an order of magnitudegreater than the typical clock-to-Q time in which the typical clock-to-Qtime can be provided, e.g., by the cell library. The ideal hold timeTH_i is kept unchanged in acquiring data delays for the differentcandidate setup times and is independent of the plurality of candidatesetup times. In some embodiments, more instances of testing signals maybe used in the simulation of step 306 such that the target setup timeTS_t is able to cover as many long timing paths as possible.

In step 308, a target setup time TS_t is selected as a minimum time spanamong the candidate setup times, and a data delay associated with thetarget setup time TS_t fulfills a data delay constraint. It is requiredthat the output data signal attains its desired value with a data delayafter the input data signal within the specified data delay constraint,referred to as a clock-to-Q constraint. The data delay constraint is apredetermined parameter of the cell provided in the cell library and mayinclude a nominal clock-to-Q time plus a delay tolerance. The delaytolerance may be represented as a ratio with respect to the nominalclock-to-Q time. For example, the nominal clock-to-Q time is determinedas 400 ps and the delay tolerance is set as 10%, which means that thevalid data delay of the cell is 440 ps. As a result, the target setuptime TS_t is regarded as the minimal setup time among the candidatesetup times within the setup time search space that fulfills the datadelay constraint.

In an embodiment, the target setup time TS_t is acquired by a searchmethod, such as a binary search algorithm. An exemplified binary searchmethod may be started by sorting the list of candidate setup times in anascending or descending order. Next, the middle element of the setuptime list is picked and subjected to the simulation. If the simulationresult shows that the resultant data delay for the middle setup timefails to meet the data delay constraint, one half of the list is chosenwith the candidate setup times greater than that of the middle element.Otherwise, if the simulation result shows that the resultant data delayfor the middle element passes the clock-to-Q constraint, another half ofthe list is chosen with the candidate setup times less than that of themiddle element. The search process is iterated in a similar way on theremaining elements of the chosen half list. For example, a new middleelement for the chosen half list is selected and subjected to thesimulation again, while the scale of the searched set is reduced by onehalf in each iteration. The abovementioned iteration is continued untilthe target setup time TS_t is determined. However, the binary searchalgorithm is for illustration only. Other search algorithms fordetermining the target setup time TS_t are also within the scope of thepresent disclosure.

In step 310, the library is updated such that a setup time of the cellis updated by the target setup time TS_t selected in step 308. Theupdated library, e.g., the library 132 in FIG. 1, will be provided tothe IC designer for conducting the circuit design procedure as shown inFIG. 1. In step 312, e.g., a design data is generated using the updatedlibrary. For instance, in step 312, at least a portion of the operationsin the flow 10 in FIG. 1 are performed according to the updated library.

Referring back to step 304, the plurality of setup times [TS_1, TS_2, .. . , TS_N] are determined to be greater than the minimal setup time insome examples. The minimal setup time for limiting the end point of thecandidate setup times [TS_1, TS_2, . . . , TS_N] may be acquired bysimulating a testing design data in response to the ideal hold timeTH_i. That is because an optimistic estimate of the setup time acquiredbased on an infinite or relatively large hold time can serve as aminimum of the candidate setup times. As a result, the space fordetermining the candidate setup times is further reduced.

FIG. 3C is a schematic flow diagram of a method 32 of measuring a holdtime based on a predetermined setup time, in accordance with someembodiments. The method 32 for measuring a target hold time TH_t issimilar to the method 30 of FIG. 3A for measuring the target setup timeTS_t. The schematic diagram of candidate hold times for method 32 issimilar to that of the time diagram 31 in FIG. 3B, and is thereforeomitted herein for brevity. Initially, in step 332, a library associatedwith a cell is received. The library may correspond to the library 132in FIG. 1. The cell is a sequential cell and may be a flop, a latch or aregister. A predetermined setup time is also received. In an embodiment,the predetermined setup time is set as an ideal setup time TS_i.Throughout the present disclosure, the ideal setup time TS_i of the cellis defined as an arbitrarily large time span for which the acquired holdtime of the cell in response to the ideal setup time is substantially atits minimum. In an embodiment, the ideal setup time TH_i is set as acycle time of the reference clock for the cell. In an embodiment, theideal setup time TS_i is set as a value smaller than the cycle time ofthe reference clock signal but much greater than a typical clock-to-Qtime, e.g., an order of magnitude greater than the typical clock-to-Qtime.

In step 334, a plurality of candidate hold times (represented by [TH_1,TH_2, . . . , TH_N]) of the cell, which are less than or no greater thana maximal hold time TH_M, are determined. In an embodiment, the maximalhold time TH_M is set as a cycle time of the reference clock signal forthe cell. In an alternative embodiment, the maximal hold time TH_M isset as one half, one third, one tenth or other ratio of the clock cycletime. The candidate hold times may be set at greater than zero or at apredetermined minimal hold time. The minimal hold time for limiting theend point of the candidate hold times [TH_1, TH_2, . . . TH_N] may beacquired by simulating a testing design data in response to the idealsetup time TS_i. In an embodiment, the candidate hold times are formedas an arithmetic sequence. In an embodiment, each pair of consecutivecandidate hold times of the plurality of candidate hold times has a samedifference. In an embodiment, the candidate hold times are arranged asother forms of sequences, e.g., the candidate hold times form a seriesof [a, ar, ar², ar³, . . . ar^(N-1)] in which the initial term a and theratio r are real numbers. In some embodiments, each pair of consecutivecandidate hold times of the plurality of candidate hold times has anon-uniform time length difference.

In step 336, a simulation is conducted to acquire a plurality of datadelays of the cell corresponding to the plurality of candidate holdtimes. The simulation is conducted in response to the ideal setup timeTS_i according to the library and the reference clock. In order toacquire information about the characteristics of the cell, at least onetest input signal is fed to the cell through the input port of the cellduring a time span in accordance with the ideal setup time and one ofthe plurality of candidate hold times. An output signal is detected atthe output port of the cell with a data delay corresponding to theselected candidate hold time. The ideal setup time TS_i is keptunchanged during the simulation while acquiring the data delays fordifferent candidate hold times, and the ideal setup time TS_i isindependent of the plurality of candidate hold times.

In step 338, a target hold time TH_t is selected as a minimum time spanamong the candidate hold times in which a data delay of the cellassociated with the target hold time TH_t fulfills a clock-to-Qconstraint. In an embodiment, the data delay constraint used formeasuring the target hold time TH_t is the same as that used formeasuring the target setup time TS_t. In step 340, the library isupdated such that a hold time of the cell is updated by the target holdtime TH_t selected in step 338. The updated library, e.g., the library132 in FIG. 1, will be provided to the IC designer for conducting thecircuit design procedure as shown in FIG. 1. In step 342, e.g., a designdata is generated using the updated library. For instance, in step 342,at least a portion of the operations in the flow 10 in FIG. 1 areperformed according to the updated library. In some embodiments, moreinstances of testing design data may be used in step 336 such that thetarget hold time TH_t is able to cover as many long timing paths aspossible.

As discussed previously, the target setup time TS_t and the target holdtime TH_t, or their combined time window, measured for a cell, determinethe period required for the input data to remain stable. As a result, asthe time window is lengthened, the clock rate may be reducedaccordingly. Some simplified measurement methods demonstrated in FIGS.3A and 3C determine the setup time and the hold time independently byignoring the finite-length effect of their counterparts (i.e., the idealhold time and ideal setup time). Although such approaches may measure asetup time or hold time with sufficiently short length, they may not beadequate in dealing with timing violations resulting from a largediscrepancy in timing path delay, as exemplified in FIG. 2A. In thedescriptions that follow, embodiments of the joint measurement methodsfor the setup time and the hold time are illustrated. The setup time andhold time using the joint determination approach are longer than thosedetermined using the simplified methods while still falling within anacceptable range, and are also able to help with discovery of morepotential timing violations.

FIG. 4A is a schematic flow diagram of a method 40 of measuring a timingwindow in accordance with some embodiments. FIG. 4B is a schematicdiagram 41 showing candidate timing windows of FIG. 4A in accordancewith some embodiments. Initially, in step 402, a library associated witha cell is received. The library may correspond to the library 132 inFIG. 1. The cell is a sequential cell and may be a flop, a latch or aregister.

In step 404, a minimum setup time TS_S of the cell is acquired inresponse to an ideal hold time TH_i according to the library and areference clock. The minimum setup time TS_S may be acquired using themethod 30 depicted in FIG. 3A in which the target setup time TS_t ofmethod 30 is acquired in response to the ideal hold time TH_i. Operationdetails are omitted for simplicity and clarity.

In an embodiment, a minimal hold time TH_S is determined based on anideal setup time TS_i. The determination method for measuring theminimal hold time TH_S is similar to that used for measuring the minimalsetup time TS_S, which is illustrated in accordance with the method 32depicted in FIG. 3C.

In step 406, a maximal hold time TH_L of the cell is acquired inresponse to the minimal setup time TS_S according to the library and thereference clock. Since the minimal setup time TS_S is less than that ofthe ideal setup time TS_i, the maximal hold time TH_L corresponding tothe minimal setup time TS_S will be greater than the minimal hold timeTH_S corresponding to the ideal setup time TS_i. In an embodiment, themaximal hold time TH_L is acquired in a manner similar to that used foracquiring the target hold time TH_t using the method 32 depicted in FIG.3C, in which the ideal setup time TS_i in step 336 is replaced by theminimal setup time TS_S. The remaining operation configurations ofmethod 32 are kept unchanged.

In step 408, a plurality of candidate hold times [TH_1, TH_2, . . . ,TH_N] of the cell are acquired. In an embodiment, a length of each ofthe plurality of candidate hold times is between zero and the maximalhold time TH_L. In an embodiment, a length of each of the plurality ofcandidate hold times is between the minimal hold time TH_S and themaximal hold time TH_L. The respective plots for the candidate holdtimes are shown in FIG. 4B. In an embodiment, the candidate hold timesare arranged in an arithmetic sequence. In an embodiment, the candidatehold times are provided using another form of sequence.

In step 410, a plurality of candidate setup times, e.g., [TS_1, TS_2, .. . , TS_N], corresponding to the plurality of candidate hold times areacquired. In an embodiment, each of the candidate setup times TS_n, n=1,. . . , N is acquired using an operation similar to the method 30, inwhich the ideal hold time TH_i in step 306 is replaced by a candidatehold time TH_n, n=1, . . . , N. To elaborate, for a candidate hold timeTH_n, a new plurality of candidate setup times TS_m, m=1, . . . , M, inwhich M is a positive integer, are determined such that the newplurality of candidate setup times TS_m, m=1, . . . , M, are differentfrom the candidate setup times TS_n, n=1, . . . , N. The candidate setuptime TS_n is selected as a minimum of the new plurality of candidatesetup times TS_m in which a data delay of the cell associated with thecandidate setup time TS_n fulfills the data delay constraint specifiedin the library. In an embodiment, a plurality of the candidate setuptimes TS_n are acquired in an increasing order of the time spans of thecandidate hold times in an attempt to reduce the search time. In anembodiment, the plurality of the candidate setup times are acquired indecreasing order of the time lengths of the candidate hold times.

In step 412, the plurality of candidate setup times are added to theplurality of candidate hold times to obtain a plurality of candidatetime windows. In each candidate time window of the plurality ofcandidate time windows, the constituent setup time and hold time arecorrelated. In step 414, a target time window is selected that has aminimum time span among the candidate time windows. In step 416, thelibrary is updated in which in which a setup time and a hold time of thecell in the library are updated according to the target time window. Thesetup time and the hold time of the cell are set as the target setuptime TS_t and the target hold time TH_t, respectively, of the targettime window. The updated library, e.g., the library 132 in FIG. 1, willbe provided to the IC designer for conducting the circuit designprocedure as shown in FIG. 1. In step 418, a design data is generatedaccording to the updated library. For instance, in step 418, at least aportion of the operations in the flow 10 in FIG. 1 are performedaccording to the updated library.

FIG. 5A is a schematic flow diagram of a method 50 of measuring a timingwindow in accordance with some embodiments. FIG. 5B is a schematicdiagram 51 showing candidate timing windows of FIG. 5A in accordancewith some embodiments. The method 50 has operations similar to those ofthe method 40 except that the roles of the setup time and the hold timeare interchanged. Initially, in step 502, a library associated with acell is received. The library may correspond to the library 132 inFIG. 1. The cell is a sequential cell and may be a flop, a latch or aregister.

In step 504, a minimum hold time TH_S of the cell is acquired inresponse to an ideal setup time TS_i according to the library and areference clock. The minimum hold time TH_S may be acquired using themethod 32 depicted in FIG. 3C, in which the target hold time TH_t ofmethod 32 is acquired in response to the ideal setup time TS_i. In anembodiment, a minimal setup time TS_S is determined based on an idealhold time TH_i. The determination method for measuring the minimal setuptime TS_S is similar to that used for measuring the minimal hold timeTH_S and is described in the method 30 depicted in FIG. 3A.

In step 506, a maximal setup time TS_L of the cell is acquired inresponse to the minimal hold time TH_S according to the library and thereference clock. In an embodiment, the maximal setup time TS_L isacquired in a manner similar to that used for acquiring the target setuptime TS_t using the method 30 depicted in FIG. 3A, in which the idealhold time TH_i in step 306 is replaced by the minimal hold time TH_S.The remaining operation configurations of method 30 are kept unchanged.

In step 508, a plurality of candidate setup times [TS_1, TS_2, . . . ,TS_N] of the cell are acquired. In an embodiment, a length of each ofthe plurality of candidate setup times is between 0 and the maximalsetup time TS_L. In an embodiment, a length of each of the plurality ofcandidate setup times is between the minimal setup time TS_S and themaximal setup time TH_L. The respective plots for the candidate setuptimes are shown in FIG. 5B. In an embodiment, the candidate setup timesare arranged in an arithmetic sequence or other sequence form.

In step 510, a plurality of candidate hold times, e.g., [TH_1, TH_2, . .. , TH_N], corresponding to the plurality of candidate setup times areacquired. In an embodiment, each of the candidate hold times TH_n, n=1,. . . , N is acquired using an operation similar to the method 32, inwhich the ideal setup time TS_i in step 336 is replaced by a candidatesetup time TS_n, n=1, . . . , N. To elaborate, for a candidate setuptime TS_n, a new plurality of candidate hold times TH_m, m=1, . . . , M,in which M is a positive integer, are determined such that the newplurality of candidate hold times TH_m, m=1, . . . , M, are differentfrom the candidate hold time TH_n, n=1, . . . , N. The candidate holdtime TH_n is selected as a minimum of the new plurality of hold timesTH_m, in which a data delay of the cell associated with the candidatehold time TH_n fulfills a predetermined data delay constraint specifiedin the library. In an embodiment, the plurality of candidate hold timesTH_n are acquired in increasing order of the time lengths of thecandidate setup times in an attempt to reduce the search time. In anembodiment, the plurality of the candidate setup times are acquired inan increasing order of the time spans of the candidate setup times.

In step 512, the plurality of candidate setup times are added to theplurality of candidate hold times to obtain a plurality of candidatetime windows. In each of the plurality of candidate time windows, theconstituent setup time and hold time are correlated. In step 514, atarget time window is selected that has a minimum time span among thecandidate time windows. In step 516, the library is updated such that asetup time and a hold time of the cell in the library are updatedaccording to the target time window. In step 518, a design data isgenerated according to the updated library. For instance, in step 518,at least a portion of the operations in the flow 10 in FIG. 1 areperformed according to the updated library.

FIG. 6A is a schematic flow diagram of a method 60 of measuring a timingwindow in accordance with some embodiments. FIG. 6B is a schematicdiagram 61 showing candidate timing windows of FIG. 6A in accordancewith some embodiments. Initially, in step 602, a library associated witha cell is received. The library may correspond to the library 132 inFIG. 1. In step 604, a minimal hold time TH_S of the cell is acquired inresponse to an ideal setup time TS_i according to the library and areference clock. In step 606, a minimal setup time TS_S of the cell isacquired in response to an ideal hold time according to the library andthe reference clock. The order of steps 604 and 606 can be interchanged,or the two steps can be performed simultaneously. In an embodiment, theminimal setup time TS_S and the minimal hold time TH_S are acquired inmanners similar to those of step 504 and step 404, respectively.

In step 608, a maximal setup time TS_L of the cell is acquired inresponse to the minimum hold time according to the library and thereference clock. Similarly, in step 610, a maximal hold time TH_L of thecell is acquired in response to the minimum setup time according to thelibrary and the reference clock. The order of steps 608 and 610 can beinterchanged, or the two steps can be performed simultaneously. In anembodiment, the maximal setup time TS_L and the maximal hold time TH_Lare acquired in manners similar to those of step 506 and step 406,respectively. As discussed previously, the maximal setup time TS_L andthe maximal hold time TH_L will be greater than the minimal setup timeTS_S and the minimal hold time TH_S, respectively.

In step 612, a candidate setup time TS_1, which is no greater than themaximum setup time, and a candidate hold time TH_1, which is no greaterthan the maximum hold time, are determined to form a candidate timewindow. The respective plots are shown in FIG. 6B. In an embodiment, thecandidate time window is determined as an initial time window. In step614, the (initial) candidate setup time and the (initial) candidate holdtime are set as a target setup time and a target hold time,respectively, of a target time window. Subsequently, in step 616, a datadelay of the cell in response to the (initial) candidate setup time andthe (initial) candidate hold time is acquired according to the libraryand the reference clock.

In step 618, it is determined whether to update the candidate timewindow. In an embodiment, the determination of whether to update thecandidate time window is based on results of examining whether the datadelay of the cell associated with the (initial) candidate time windowfulfills the data delay constraint. If affirmative, it is indicated thatthe current candidate time window is adequate for fulfilling the datadelay constraint, but may not be the optimal time window. The method 60proceeds with step 620 in which the (current) candidate setup time andthe (current) candidate hold time (e.g., TS_1 and TH_1 in FIG. 6B) areset as the target setup time and the target hold time, respectively.Subsequently, the current candidate time window is updated by reducingat least one of the (current) candidate setup time and the (current)candidate hold time of the (current) candidate time window. An updatedtime window is thus obtained that includes an updated setup time and anupdated hold time (e.g., TS_2 and TH_2 in FIG. 6B). In an embodiment,the candidate time window obtained in step 622 is reduced iteratively byreducing one of the candidate setup time and the candidate hold time, orboth. In an embodiment, the reduced candidate setup time or hold timehas a duration of x % of its previous candidate setup time or hold time,in which x a number less than 100, e.g., 90, 85 or 80. In an embodiment,the reduction ratio between the two consecutive candidate time windowsmay be the same or different. The method 60 loops back to step 616, inwhich a data delay of the cell is acquired in response to the (updated)candidate setup time and the (updated) candidate hold time (e.g., TS_2and TH_2 in FIG. 6B) according to the library and the reference clock.The loop formed by the steps 616, 618 and 620 is iterative, and thestatus is monitored in step 618 of each iteration to determine whetherthe data delay of the cell associated with the current candidate timewindow causes a data delay that fulfills the data delay constraint.Referring back to step 618, if it is determined during an iteration thata candidate time window including a candidate setup time and a candidatehold time (e.g., TS_n and TH_n) is reduced to become too short to causea corresponding data delay that fulfills the data delay constraint, itis indicated that the previous candidate time window including thecandidate setup time and candidate hold time (e.g., TS_(n−1) andTH_(n−1)) should be the desired setup time and hold time. It should benoted that such desired setup time and hold time have been recorded asthe target setup time and target hold time in a previous iteration instep 620. The method 60 will therefore terminate the loop by halting thefurther update to the candidate setup time and the candidate hold time.Next, the method proceeds with step 624, in which the library is updatedby setting a setup time and a hold time of the cell according to thetarget setup time and the target hold time, respectively, in response todetermining that the data delay of the cell fails to meet the data delayconstraint. That will guarantee that the target setup time and targethold time that fulfill the data delay constraint have a minimal timewindow. In step 626, a design data is generated according to the updatedlibrary. For instance, in step 626, at least a portion of the operationsin the flow 10 in FIG. 1 are performed according to the updated library.

FIG. 7 is a schematic diagram of a system 70 implementing layoutdesigns, in accordance with some embodiments. The system 70 includes aprocessor 701, a network interface 703, an input/output (I/O) device705, a storage device 707, a bus 708 and a memory 709. The bus 708couples the network interface 703, the I/O device 705, the storagedevice 707, the memory 709 and the processor 701 to each other.

The processor 701 is configured to execute program instructions thatinclude a tool configured to perform the method as described andillustrated with reference to figures of the present disclosure.Accordingly, the tool is configured to execute the steps such as:receive design specifications and a library, perform pre-layoutsimulation, generate a design data for a layout, perform layoutaccessing, determine parameter of timing of the library, determining aplurality of candidate setup times or hold times, perform a binarysearch algorithm, update the library, perform operations of placementand routing, perform LVS, generate a consolidated netlist byincorporating the parameters, perform post-layout simulation and verifythe post-layout simulation result.

The network interface 703 is configured to access program instructionsand data accessed by the program instructions stored remotely through anetwork (not shown).

The I/O device 705 includes an input device and an output deviceconfigured for enabling user interaction with the system 70. In someembodiments, the input device includes, for example, a keyboard, a mouseand other devices. The output device includes, for example, a display, aprinter and other devices.

The storage device 707 is configured for storing program instructionsand data accessed by the program instructions. In some embodiments, thestorage device 707 includes a non-transitory computer readable storagemedium, for example, a flash memory, a magnetic disk, an optical disk orthe like.

The memory 709 is configured to store program instructions to beexecuted by the processor 701 and data accessed by the programinstructions. In some embodiments, the memory 709 includes anycombination of a random access memory (RAM), some other volatile storagedevice, a read only memory (ROM), and some other non-volatile storagedevice.

According to an embodiment, a method is provided. The method includes:receiving a library associated with a cell; determining a plurality ofcandidate hold times for the cell; acquiring a plurality of candidatesetup times corresponding to the plurality of candidate hold times,wherein a data delay associated with each of the candidate setup timefulfills a data delay constraint for the cell; adding the plurality ofcandidate setup times to the plurality of candidate hold times,respectively, to obtain a plurality of candidate time windows; andselecting a target time window having a minimal time span among thecandidate time windows. At least one of the receiving, determining,acquiring, adding and selecting steps is conducted by at least oneprocessor.

According to an embodiment, a method is provided. The method includes:receiving a library associated with a cell; determining a plurality ofcandidate setup times for the cell; acquiring a plurality of candidatehold times corresponding to the plurality of candidate setup times,wherein a data delay associated with each of the candidate hold timefulfills a data delay constraint for the cell; adding the plurality ofcandidate setup times to the plurality of candidate hold times,respectively, to obtain a plurality of candidate time windows; andselecting a target time window having a minimal time span among thecandidate time windows. At least one of the receiving, determining,acquiring, adding and selecting steps is conducted by at least oneprocessor.

According to an embodiment, a method is provided. The method includes:receiving a library associated with a cell; determining a candidatesetup time no greater than a maximum setup time and a candidate holdtime no greater than a maximum hold time to form a candidate timewindow, wherein the determination of the candidate setup time isindependent of the determination of the candidate hold time; setting thecandidate setup time and the candidate hold time as a target setup timeand a target hold time, respectively, of a target time window inresponse to determining the target time window as fulfilling a datadelay constraint; and performing an operation loop. The operation loopincludes: reducing at least one of the candidate setup time and thecandidate hold time of the candidate time window to obtain an updatedcandidate time window; and setting the updated candidate time window asthe target time window in response to determining the updated candidatetime window as fulfilling the data delay constraint. The operation loopstops when the updated candidate time window fails to meet the datadelay constraint. At least one of the receiving, determining, setting,performing and reducing steps is conducted by at least one processor.

The foregoing outlines features of several embodiments so that thoseskilled in the art may better understand the aspects of the presentdisclosure. Those skilled in the art should appreciate that they mayreadily use the present disclosure as a basis for designing or modifyingother processes and structures for carrying out the same purposes and/orachieving the same advantages of the embodiments introduced herein.Those skilled in the art should also realize that such equivalentconstructions do not depart from the spirit and scope of the presentdisclosure, and that they may make various changes, substitutions, andalterations herein without departing from the spirit and scope of thepresent disclosure.

What is claimed is:
 1. A method, comprising: receiving a libraryassociated with a cell; determining a plurality of candidate hold timesfor the cell; acquiring a plurality of candidate setup timescorresponding to the plurality of candidate hold times, wherein a datadelay associated with each of the candidate setup time fulfills a datadelay constraint for the cell; adding the plurality of candidate setuptimes to the plurality of candidate hold times, respectively, to obtaina plurality of candidate time windows; and selecting a target timewindow having a minimal time span among the candidate time windows,wherein at least one of the receiving, determining, acquiring, addingand selecting steps is conducted by at least one processor.
 2. Themethod according to claim 1, further comprising setting a setup time anda hold time of the cell in the library according to the target timewindow.
 3. The method according to claim 2, further comprisinggenerating a design data according to the setup time and hold time ofthe cell in the library.
 4. The method according to claim 1, wherein alength of each of the plurality of candidate hold times is greater thana minimum hold time of the cell, wherein the minimum hold time isacquired in response to an ideal setup time according to the library anda reference clock for the cell.
 5. The method according to claim 4, theminimum hold time is acquired using a binary search algorithm.
 6. Themethod according to claim 4, wherein a length of the ideal setup time isdetermined such that an acquired hold time is at its minimum in responseto the ideal setup time.
 7. The method according to claim 6, wherein thelength of the ideal setup time is set as a cycle time of the referenceclock.
 8. The method according to claim 1, wherein the plurality ofcandidate hold times form an arithmetic sequence.
 9. The methodaccording to claim 1, wherein a length of each of the plurality ofcandidate hold times is less than a maximum hold time of the cell,wherein the maximum hold time is acquired in response to a minimum setuptime.
 10. The method according to claim 9, wherein the minimum setuptime is acquired in response to an ideal hold time according to thelibrary and a reference clock for the cell.
 11. A method, comprising:receiving a library associated with a cell; determining a plurality ofcandidate setup times for the cell; acquiring a plurality of candidatehold times corresponding to the plurality of candidate setup times,wherein a data delay associated with each of the candidate hold timefulfills a data delay constraint for the cell; adding the plurality ofcandidate setup times to the plurality of candidate hold times,respectively, to obtain a plurality of candidate time windows; andselecting a target time window having a minimal time span among thecandidate time windows, wherein at least one of the receiving,determining, acquiring, adding and selecting steps is conducted by atleast one processor.
 12. The method according to claim 11, furthercomprising setting a setup time and a hold time of the cell in thelibrary according to the target time window, simulating a design dataaccording to the library, and fabricating a circuit based on the designdata.
 13. The method according to claim 12, wherein a length of each ofthe plurality of candidate setup times is greater than a minimum setuptime of the cell, wherein the minimum setup time is acquired in responseto an ideal hold time according to the library and a reference clock.14. The method according to claim 11, wherein each pair of consecutivecandidate hold times of the plurality of candidate hold times has anon-uniform time length difference.
 15. The method according to claim14, wherein each of the plurality of candidate hold times correspondingto the plurality of candidate setup times is acquired using a binarysearch method.
 16. A method, comprising: receiving a library associatedwith a cell; determining a candidate setup time no greater than amaximum setup time and a candidate hold time no greater than a maximumhold time to form a candidate time window, wherein the determination ofthe candidate setup time is independent of the determination of thecandidate hold time; setting the candidate setup time and the candidatehold time as a target setup time and a target hold time, respectively,of a target time window in response to determining the target timewindow as fulfilling a data delay constraint; and performing anoperation loop comprising: reducing at least one of the candidate setuptime and the candidate hold time of the candidate time window to obtainan updated candidate time window; and setting the updated candidate timewindow as the target time window in response to determining the updatedcandidate time window as fulfilling the data delay constraint, whereinthe operation loop stops when the updated candidate time window fails tomeet the data delay constraint, wherein at least one of the receiving,determining, setting, performing and reducing steps is conducted by atleast one processor.
 17. The method according to claim 16, furthercomprising setting a setup time and a hold time of the cell according tothe target setup time and the target hold time, respectively, inresponse to the stop of the operation loop.
 18. The method according toclaim 16, wherein reducing at least one of the candidate setup time andthe candidate hold time of the candidate time window comprises reducingboth the candidate setup time and the candidate hold time of thecandidate time window.
 19. The method according to claim 16, furthercomprising acquiring a minimum hold time of the cell in response to anideal setup time according to the library and a reference clock, whereinthe maximum setup time is acquired based on the minimum hold time. 20.The method according to claim 16, further comprising acquiring a minimumsetup time of the cell in response to an ideal hold time according tothe library and a reference clock, wherein the maximum hold time isacquired based on the minimum setup time.